Cover tree - PDFSEARCH.IO - Document Search Engine

Cover tree
Results: 252

#	Item
81	OPERATION TREE CANOPY Get Under Cover! Help scientists study the benefits of urban trees in Riverside. Citizen scientists (volunteers who collect research data) are needed to collect important information about urban tre Add to Reading List Source URL: www.riversideca.gov Language: English - Date: 2015-03-22 12:17:52 Urban forest Earthwatch Institute Riverside California Geography of California Citizen science Southern California Forestry Environmental design Environment
82	Understanding Farmers’ Challenges and Evaluating Impacts of a Sustainable Agriculture NGO in Communities of Southern Guatemala Jose Juan Perez Orozco - Problem Tree Introduction Add to Reading List Source URL: sites.clas.ufl.edu Language: English - Date: 2014-03-21 14:52:14 Land management No-till farming Food security Cover crop Tillage Agricultural soil science Soil science Agriculture
83	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics
84	Noname manuscript No. (will be inserted by the editor) On Tractable Cases of Target Set Selection Andr´ Add to Reading List Source URL: www.akt.tu-berlin.de Language: English - Date: 2012-06-07 13:36:43 NP-complete problems Vertex cover Kernelization Feedback vertex set Clique Dominating set Tree decomposition Graph Vertex Graph theory Theoretical computer science Mathematics
85	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
86	(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non- Add to Reading List Source URL: meshcompression.org Language: English - Date: 2014-01-25 07:24:06 3D computer graphics Tree traversal Graph Vertex Mesh generation Polygon mesh Graph theory Mathematics Theoretical computer science
87	Annual Report Report for Fiscal 2012 Cover Photo:Young Tree of Ancient Jomon Cedar in Yakushima, Kagoshima Pref. Photo by Natsumi Washizawa, Program Officer, The Toyota Foundation Add to Reading List Source URL: www.toyotafound.or.jp Language: English - Date: 2014-08-17 22:11:42 National Institutes of Health Nursing research Toyota Health Ford Foundation University of Alabama at Birmingham Asian Cultural Council Medicine Bethesda Maryland Cancer research
88	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems
89	Linear cover time for trees is exponentially unlikely Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-12-09 16:22:45 Tree Line graph Random walk Random graph Loop-erased random walk Graph theory Stochastic processes Graph operations
90	New Races in Parameterized Algorithmics Christian Komusiewicz and Rolf Niedermeier Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany {christian.komusiewicz,rolf.niedermeier}@tu-berlin.de Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-08-07 06:26:48 NP-complete problems Parameterized complexity Kernelization Path decomposition Vertex cover Feedback vertex set Dominating set Tree decomposition Clique Graph theory Theoretical computer science Mathematics

UPDATE